#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int n;
//	freopen("in.txt", "r", stdin);
	cin.sync_with_stdio(false);
	while (cin>>n) {
		string s[n], old[n];
		for (int i=0; i<n; ++i) {
			cin>>s[i];
			old[i]=s[i];
		}
		sort(s, s+n);
		int flag=1;
		for (int i=0; i<n; ++i) {
			if (s[i]!=old[i]) flag=0;
		}
		if (flag==0) {
			flag=-1;
			for (int i=0; i<n; ++i) {
				if (s[i]!=old[n-i-1]) flag=0;
			}
		}
		if (flag==1) cout<<"INCREASING"<<endl;
		else if (flag==-1) cout<<"DECREASING"<<endl;
		else cout<<"NEITHER"<<endl;
	}
	return 0;
} 
